Exponential time hypothesis - PDFSEARCH.IO - Document Search Engine

Exponential time hypothesis
Results: 28

#	Item
21	On Problems as Hard as CNF-SAT∗ Marek Cygan† Holger Dell‡ Jesper Nederlofk Add to Reading List Source URL: arxiv.org Language: English - Date: 2014-03-27 21:09:14 NP-complete problems Exponential time hypothesis Conjunctive normal form Boolean satisfiability problem Vertex cover Set cover problem Time complexity Graph coloring Independent set Theoretical computer science Computational complexity theory Applied mathematics
22	Lower bounds based on the Exponential Time Hypothesis Daniel Lokshtanov∗ Dániel Marx† Add to Reading List Source URL: www.win.tue.nl Language: English - Date: 2013-05-30 15:14:06 NP-complete problems Complexity classes Mathematical optimization Analysis of algorithms Parameterized complexity Exponential time hypothesis NP-complete Time complexity Feedback vertex set Theoretical computer science Computational complexity theory Applied mathematics
23	Journal of Artificial Intelligence Research234 Submitted 8/14; published 1/15 On the Subexponential-Time Complexity of CSP Ronald de Haan Add to Reading List Source URL: www.jair.org Language: English - Date: 2015-01-30 21:27:29 Constraint programming Constraint satisfaction problem Constraint satisfaction Exponential time hypothesis Boolean satisfiability problem NP-complete Tree decomposition Conjunctive normal form Time complexity Theoretical computer science Applied mathematics Computational complexity theory
24	A quick summary of the field of Parameterized Complexity, 2012 Overview Parameterized Complexity is a recent branch of computational complexity theory that provides a framework for a refined analysis of hard algorithmic Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2012-09-22 20:37:29 Analysis of algorithms Parameterized complexity Michael Fellows Kernelization Bidimensionality Exponential time hypothesis Time complexity Complexity FO Theoretical computer science Computational complexity theory Applied mathematics
25	The Local Lemma is tight for SAT∗ H. Gebauer †, T. Szab´o ‡, G. Tardos § Abstract Add to Reading List Source URL: www.renyi.hu Language: English - Date: 2013-09-26 08:48:45 NP-complete problems Boolean algebra Boolean satisfiability problem Electronic design automation Logic in computer science Hypergraph Unsatisfiable core Exponential time hypothesis MAX-3SAT Theoretical computer science Mathematics Applied mathematics
26	NBER WORKING PAPER SERIES POLICY EFFECTS IN HYPERBOLIC VS. EXPONENTIAL MODELS OF CONSUMPTION AND RETIREMENT Alan L. Gustman Thomas L. Steinmeier Add to Reading List Source URL: www.nber.org Language: English - Date: 2011-12-05 14:40:32 Economics Game theory Microeconomics Utility Time preference Expected utility hypothesis Economic model Discounting Intertemporal choice Behavioral finance Decision theory Hyperbolic discounting
27	On the possibility of faster SAT algorithms Mihai Pˇatra¸scu∗ AT&T Labs Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2009-11-12 23:47:30 NP-complete problems Logic in computer science Exponential time hypothesis 2-satisfiability Boolean satisfiability problem Conjunctive normal form Time complexity Parameterized complexity Dominating set Theoretical computer science Computational complexity theory Applied mathematics
28	PDF Document Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2009-10-12 16:16:00 NP-complete problems Logic in computer science Boolean algebra Analysis of algorithms Exponential time hypothesis 2-satisfiability Conjunctive normal form Boolean satisfiability problem Clique problem Theoretical computer science Computational complexity theory Applied mathematics